EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing

The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...

متن کامل

A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.03.077 ⇑ Corresponding author. Tel.: +90 212 3832868. E-mail addresses: [email protected] (G.N. Y (N.Ç. Demirel). In this paper, a new type of geometric shape based genetic clustering algorithm is proposed. A genetic algorithm based on this clustering technique is developed for the solution process of the multi-depot...

متن کامل

An Improved Adaptive Genetic Algorithm for the Multi-depot Vehicle Routing Problem with Time Window

In order to improve the efficiency of vehicle objective, the paper addresses the problem of multi-depot vehicle routing with time window. An adaptive genetic algorithm based on the artificial bee colony algorithm is developed for the solution process of the multi-depot vehicle routing problem. The new algorithm provides not only with the strong global search capability, but also the strong loca...

متن کامل

capacitated multi-depot vehicle routing problem with inter-depot routes

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

متن کامل

Solving the Multi Depot Vehicle Routing Problem with Assignment Algorithm

The Vehicle Routing Problem (VRP) involves the design of a set of minimum cost vehicle routes, originating and terminating at a central depot, for a fleet of vehicles that services a set of customers with known demands. This study contains some information about Logistics and Supply Chain Management. In the second part Distribution Management, which is a more related subject with Vehicle Routin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ICST Transactions on Scalable Information Systems

سال: 2019

ISSN: 2032-9407

DOI: 10.4108/eai.10-6-2019.159099